Approximate Algorithms for Touring a Sequence of Polygons
نویسندگان
چکیده
Given two points p and q and a finite number of simple polygons in a plane. The basic version of a touring-a-sequence-of-polygons problem (in brief: a touring polygons problem, TPP) is how to find a shortest path such that it starts at p, then it visits these polygons in the given order, and finally it ends at q. This paper describes approximate algorithms for different versions of touring polygons problems. Among its important results it provides, for example, an answer to the previously open problem “What is the complexity of the touring polygons problem for pairwise disjoint nonconvex simple polygons?” by providing a κ(ε)-linear approximate algorithm for solving this problem, with
منابع مشابه
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is to find a shortest path such that it starts at p, then visits these polygons in the given order, and ends at q. This paper describes four approximation algorithms for unconstrained versions of problems defined by tour...
متن کاملTouring a Sequence of Weighted Polygons
In this paper we will solve a generalization of the problem “Touring a Sequence of Polygons” where polygons can be concave and a weight is considered when visiting them. The main idea to solve the problem is triangulation of the polygons and adding some Steiner on the edges. We will also use a modified version of BUSHWHACK algorithm to find the shortest path among Steiner points. The running ti...
متن کاملOn The Watchman Route Problem and Its Related Problems
We propose to study the watchman route problem and its related problems. The watchman route problem asks a shortest closed path within a given polygon so that every point in the polygon is visible from at least one point on the path. We first discuss the watchman route problem for simple polygons, for polygonal domains, and for arrangements of lines and line segments. We then focus on a problem...
متن کاملTouring a Sequence of Line Segments in Polygonal Domain Fences
In this paper, we consider the problem of touring a sequence of line segments in presence of polygonal domain fences. In this problem there is a sequence S = (s = S0, . . . , Sk, Sk+1 = t) in which s and t are respectively start and target points and S1, . . . , Sk are line segments in the plane. Also, we are given a sequence F = (F0, . . . , Fk) of planar polygonal domains called fences such t...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کامل